An Adaptive Neighboring Search using Crossover-like Mutation for Function Optimization
نویسندگان
چکیده
منابع مشابه
Multi-Objective Optimization of Solar Thermal Energy Storage Using Hybrid of Particle Swarm Optimization and Multiple Crossover and Mutation Operator
Increasing of net energy storage (Q net) and discharge time of phase change material (t PCM), simultaneously, are important purpose in the design of solar systems. In the present paper, Multi-Objective (MO) based on hybrid of Particle Swarm Optimization (PSO) and multiple crossover and mutation operator is used for Pareto based optimization of solar systems. The conflicting objectives are Q net...
متن کاملA fuzzy adaptive neighborhood search for function optimization
A Fuzzy Adaptive Neighborhood Search for Function Optimization David A. Pelta Armando Blanco Jose-L. Verdegay Depto. de Ciencias de la Computaci6n e Inteiigencia Artificial. Universidad de Granada, Granada, Spain {dpelta,armando ,verdegay}@ugr . es Neighborhood based search algorithms have been applied with success in the optimization field. In this work, a Fuzzy Adaptive Neighborhood Search al...
متن کاملAirfoil Shape Optimization with Adaptive Mutation Genetic Algorithm
An efficient method for scattering Genetic Algorithm (GA) individuals in the design space is proposed to accelerate airfoil shape optimization. The method used here is based on the variation of the mutation rate for each gene of the chromosomes by taking feedback from the current population. An adaptive method for airfoil shape parameterization is also applied and its impact on the optimum desi...
متن کاملEvolving Crossover Operators for Function Optimization
A new model for evolving crossover operators for evolutionary function optimization is proposed in this paper. The model is a hybrid technique that combines a Genetic Programming (GP) algorithm and a Genetic Algorithm (GA). Each GP chromosome is a tree encoding a crossover operator used for function optimization. The evolved crossover is embedded into a standard Genetic Algorithm which is used ...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications
سال: 2001
ISSN: 2188-4730,2188-4749
DOI: 10.5687/sss.2001.131